Performance Driven Global Routing Through Gradual Re nement
نویسندگان
چکیده
We propose a heuristic for VLSI interconnect global routing that can optimize routing congestion delay and number of bends which are often competing objectives Routing exibilities under timing constraints are obtained and exploited to reduce congestion subject to timing constraints The wire routes are determined through gradual re nement according to probabilistic estimation on congestions so that the congestion is minimized while the number of bends on wires are limited The experiments on both random generated circuits and benchmark circuits con rm the e ectiveness of this method
منابع مشابه
Discover: A Resource Discovery System Based on Content Routing
We have built an HTTP based resource discovery system called Discover that provides a single point of access to over 500 WAIS servers. Discover provides two key services: query re nement and query routing. Query re nement helps a user improve a query fragment to describe the user's interests more precisely. Once a query has been re ned and describes a manageable result set, query routing automa...
متن کاملData Driven Theory Re nement Using KBDistAl
Knowledge based arti cial neural networks o er an attrac tive approach to extending or modifying incomplete knowledge bases or domain theories through a process of data driven theory re nement We present an e cient algorithm for data driven knowledge discovery and theory re nement using DistAl a novel inter pattern distance based polynomial time constructive neural network learning algorithm Th...
متن کاملContent routing: a scalable architecture for network-based information discovery
This thesis presents a new architecture for information discovery based on a hierarchy of content routers that provide both browsing and search services to end users. Content routers catalog information servers, which may in turn be other content routers. The resulting hierarchy of content routers and leaf servers provides a rich set of services to end users for locating information, including ...
متن کاملData-driven theory refinement algorithms for bioinformatics
Bioinformatics and related applications call for e cient algorithms for knowledge intensive learning and data driven knowledge re nement Knowledge based arti cial neural networks o er an attractive approach to ex tending or modifying incomplete knowledge bases or do main theories We present results of experiments with sev eral such algorithms for data driven knowledge discovery and theory re ne...
متن کامل